/*
  SOLID - Interference Detection Library
  Copyright (C) 1997 Gino van den Bergen

  This library is free software; you can redistribute it and/or
  modify it under the terms of the GNU Library General Public
  License as published by the Free Software Foundation; either
  version 2 of the License, or (at your option) any later version.

  This library is distributed in the hope that it will be useful,
  but WITHOUT ANY WARRANTY; without even the implied warranty of
  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
  Library General Public License for more details.

  You should have received a copy of the GNU Library General Public
  License along with this library; if not, write to the Free
  Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.

  Please send remarks, questions and bug reports to gino@win.tue.nl,
  or write to:
                  Gino van den Bergen
		  Department of Mathematics and Computing Science
		  Eindhoven University of Technology
		  P.O. Box 513, 5600 MB Eindhoven, The Netherlands
*/

#ifndef _POLYGON_H_
#define _POLYGON_H_

#include <3D/Point.h>
#include "Plane.h"

class Transform;
class PointBuf;

class Polygon {
public:
  Polygon(int npoints, const Point *points);
  Polygon(const Polygon& x, const Transform& t);

  ~Polygon();
  
  const Point& operator[](int i) const { return verts[i]; }

  int size() const { return nverts; }
  const Plane& plane() const { return plneq; }
  Point* getVertex() const { return verts; }

  bool contains(const Point& p) const;
  void interval(const Plane& plane, Scalar& b, Scalar& e) const;

private:
  Point *verts;
  int nverts;
  Plane plneq;

  // Never used!!
  Polygon(const Polygon& x);
  Polygon& operator=(const Polygon& x);
};

bool intersect(const Polygon& poly1, const Polygon& poly2);
void intersect(const Polygon& poly1, const Polygon& poly2, PointBuf& report);

#endif
